An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Authors
Abstract:
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme is quite commendable in comparison with the previous work in terms of security and time complexity.
similar resources
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
full textAn Efficient Blind Signature Scheme Based on the Elliptic Curve Discrete Logarithm Problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
full textA Stamped Blind Signature Scheme based on Elliptic Curve Discrete Logarithm Problem
Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collision-resistant cryptographic hash functions.
full textA GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem
In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The ...
full textAn Efficient Self Proxy Signature Scheme Based on Elliptic Curve Discrete Logarithm Problems
Self proxy signature is a type of proxy signature wherein, the original signer delegates the signing rights to himself, there by generating temporary public and private key pairs for himself. The aim of self proxy is to protect the signer's permanent secret key. Most of proposed self proxy signature scheme have been based on discrete logarithms which required for a protocol to generate and veri...
full textA Novel Untraceable Blind Signature Based on Elliptic Curve Discrete Logarithm Problem
In this paper, a novel Blind Signature Scheme (BSS) has been proposed. The scheme is based on Elliptic Curve Discrete Logarithm Problem (ECDLP). It allows a requester to obtain signature from a signer on any document, in such a way that the signer learns nothing about the message that is being signed. The scheme utilizes the inherent advantage of Elliptic Curve Cryptosystem in terms of smaller ...
full textMy Resources
Journal title
volume 1 issue 2
pages 125- 131
publication date 2009-07-25
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023